Chromatic Roots and Minor-Closed Families of Graphs
نویسنده
چکیده
Given a minor-closed class of graphs G, what is the infimum of the non-trivial roots of the chromatic polynomial of G ∈ G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minorclosed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.
منابع مشابه
List-chromatic Number and the Chromatic Number in Minor-closed and Odd-minor-closed Classes of Graphs
It is well-known (Feige and Kilian [24], H̊astad [39]) that approximating the chromatic number within a factor of n1−ε cannot be done in polynomial time for ε > 0, unless coRP = NP. Computing the list-chromatic number is much harder than determining the chromatic number. It is known that the problem of deciding if the list-chromatic number is k, where k ≥ 3, is Πp2-complete [37]. In this paper, ...
متن کاملPlanar triangulations with real chromatic roots arbitrarily close to four
We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملClustered Colouring in Minor-Closed Classes
The clustered chromatic number of a class of graphs is the minimum integer k such that for some integer c every graph in the class is k-colourable with monochromatic components of size at most c. We prove that for every graph H , the clustered chromatic number of the class of H-minor-free graphs is tied to the tree-depth of H . In particular, if H has tree-depth t then every H-minor-free graph ...
متن کاملLayered Separators in Minor-Closed Families with Applications
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω( √ n) in graphs with n vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a layered separator, which may have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2016